Towards a Constraint Parser for Categorial Type Logics
نویسندگان
چکیده
This thesis shows how constraint programming can be applied to the processing of Categorial Type Logics (CTL). It presents a novel formalisation of the parsing task for categorial grammars as a tree configuration problem, and demonstrates how a recent proposal for structural constraints on CTL parse trees [11] can be integrated into this framework. The resulting processing model has been implemented using the Mozart/Oz programming environment. It appears to be a promising starting point for further research on the application of constraint parsing to CTL and the investigation of the practical processing complexity of CTL grammar fragments.
منابع مشابه
Multi-dimensional Type Theory: Rules, Categories, and Combinators for Syntax and Semantics
We investigate the possibility of modelling the syntax and semantics of natural language by constraints, or rules, imposed by the multi-dimensional type theory Nabla. The only multiplicity we explicitly consider is two, namely one dimension for the syntax and one dimension for the semantics, but the general perspective is important. For example, issues of pragmatics could be handled as addition...
متن کاملMemoization of Coroutined Constraints
Some linguistic constraints cannot be effectively resolved during parsing at the location in which they are most naturally introduced. This paper shows how constraints can be propagated in a memoizing parser (such as a chart parser) in much the same way that variable bindings are, providing a general treatment of constraint coroutining in memoization. Prolog code for a simple application of our...
متن کاملReasoning with Categorial Grammar Logic
The article presents the first results we have obtained studying natural reasoning from a proof-theoretic perspective. In particular we focus our attention on monotonic reasoning. Our system consists of two parts: (i) A Formal Grammar – a multimodal version of classical Categorial Grammar – which while syntactically analysing linguistic expressions given as input, computes semantic information ...
متن کاملA Supervised Semantic Parsing with Lexicon Extension and Syntactic Constraint
Existing semantic parsing research has steadily improved accuracy on a few domains and their corresponding meaning representations. In this paper, we present a novel supervised semantic parsing algorithm, which includes the lexicon extension and the syntactic supervision. This algorithm adopts a large-scale knowledge base from the open-domain Freebase to construct efficient, rich Combinatory Ca...
متن کاملCategorial Grammars and Substructural Logics
Substructural logics are formal logics whose Gentzen-style sequent systems abandon some/all structural rules (Weakening, Contraction, Exchange, Associativity). They have extensively been studied in current literature on nonclassical logics from different points of view: as sequent axiomatizations of relevant, multiple-valued and fuzzy logics [73, 44], as so-called resource-sensitive logics for ...
متن کامل